Transparent Face Recognition in the Home Environment

The BASIS project is about the secure application of transparent biometrics in the home environment. Due to transparency and home-setting requirements there is variance in appearance of the subject. An other problem which needs attention is the extraction of features. The quality of the extracted features is not only depending on the proper preprocessing of the input data but also on the suitability of the extraction algorithm for this problem. Possible approaches to address problems due to transparency requirements are the use of active appearance models in face recognition, smart segmentation, multi-camera solutions and tracking. In this paper an inventory of problems and possible solution will be give

Comparing landmarking methods for face recognition

Good registration (alignment to a reference) is essential for accurate face recognition. We use the locations of facial features (eyes, nose, mouth, etc) as landmarks for registration. Two landmarking methods are explored and compared: (1) the Most Likely-Landmark Locator (MLLL), based on maximizing the likelihood ratio [1], and (2) Viola-Jones detection [2]. Further, a landmark-correction method based on projection into a subspace is introduced. Both landmarking methods have been trained on the landmarked images in the BioID database [3]. The MLLL has been trained for locating 17 landmarks and the Viola-Jones method for 5 landmarks. The localization error and effects on the equal-error rate (EER) have been measured. In these experiments ground- truth data has been used as a reference. The results are described as follows:\ud 1. The localization errors obtained on the FRGC database are 4.2, 8.6 and 4.6 pixels for the Viola-Jones, the MLLL, and the MLLL after landmark correction, respectively. The inter-eye distance of the reference face is 100 pixels. The MLLL with landmark correction scores best in the verification experiment.\ud 2. Using more landmarks decreases the average localization error and the EER

Grip-Pattern Recognition for Smart Guns

This paper describes the design, implementation and evaluation of a user-verification system for a smart gun, which is based on grip-pattern recognition. An existing pressure sensor consisting of an array of 44 x 44 piezoresistive elements has been used. An interface has been developed to acquire pressure images from the sensor. The values of the pixels in the pressure-pattern images are used as inputs for a verification algorithm, which is currently implemented in software on a computer. The verification algorithm is based on a likelihood-ratio classifier for Gaussian probability densities. First results indicate that it is possible to use grip-pattern recognition for biometric verification, when allowing a certain false-rejection and false-acceptance rate. However, more measurements are needed to give a more reliable indication of the systems performance

Algorithm design for grip-pattern verification in smart gun

The Secure Grip project1 focuses on the development of a hand-grip pattern recognition system, as part of the smart gun. Its target customer is the police. To explore the authentication performance of this system, we collected data from a group of police officers, and made authentication simulations based on a likelihood-ratio classifier. This smart gun system has been proved to be useful in the authentication of the police officers. However, its authentication performance needs some further improvement, especially when data for training and testing were collected with some time in between. We present and analyze the simulation results of the authentication experiment. Based on the analyses, we propose some methods to improve the system¿s authentication performance

A landmark paper in face recognition

Good registration (alignment to a reference) is essential for accurate face recognition. The effects of the number of landmarks on the mean localization error and the recognition performance are studied. Two landmarking methods are explored and compared for that purpose: (1) the most likely-landmark locator (MLLL), based on maximizing the likelihood ratio, and (2) Viola-Jones detection. Both use the locations of facial features (eyes, nose, mouth, etc) as landmarks. Further, a landmark-correction method (BILBO) based on projection into a subspace is introduced. The MLLL has been trained for locating 17 landmarks and the Viola-Jones method for 5. The mean localization errors and effects on the verification performance have been measured. It was found that on the eyes, the Viola-Jones detector is about 1% of the interocular distance more accurate than the MLLL-BILBO combination. On the nose and mouth, the MLLL-BILBO combination is about 0.5% of the inter-ocular distance more accurate than the Viola-Jones detector. Using more landmarks will result in lower equal-error rates, even when the landmarking is not so accurate. If the same landmarks are used, the most accurate landmarking method gives the best verification performance

A Comparison of Hand-Geometry Recognition Methods Based on Low- and High-Level Features

This paper compares the performance of hand-geometry recognition based on high-level features and on low-level features. The difference between high- and low-level features is that the former are based on interpreting the biometric data, e.g. by locating a finger and measuring its dimensions, whereas the latter are not. The low-level features used here are landmarks on the contour of the hand. The high-level features are a standard set of geometrical features such as widths and lengths of fingers and angles, measured at preselected locations

Spectral representation of fingerprints

Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and directions suffering from various deformations such as translation, rotation and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with a template protection scheme, which requires a fixed-length feature vector. This paper introduces the idea and algorithm of spectral minutiae representation. A correlation based spectral minutiae\ud matching algorithm is presented and evaluated. The scheme shows a promising result, with an equal error rate of 0.2% on manually extracted minutiae

Fingerprint Verification Using Spectral Minutiae Representations

Most fingerprint recognition systems are based on the use of a minutiae set, which is an unordered collection of minutiae locations and orientations suffering from various deformations such as translation, rotation, and scaling. The spectral minutiae representation introduced in this paper is a novel method to represent a minutiae set as a fixed-length feature vector, which is invariant to translation, and in which rotation and scaling become translations, so that they can be easily compensated for. These characteristics enable the combination of fingerprint recognition systems with template protection schemes that require a fixed-length feature vector. This paper introduces the concept of algorithms for two representation methods: the location-based spectral minutiae representation and the orientation-based spectral minutiae representation. Both algorithms are evaluated using two correlation-based spectral minutiae matching algorithms. We present the performance of our algorithms on three fingerprint databases. We also show how the performance can be improved by using a fusion scheme and singular points

Spatially-Variant Directional Mathematical Morphology Operators Based on a Diffused Average Squared Gradient Field

International audienceThis paper proposes an approach for mathematical morphology operators whose structuring element can locally adapt its orientation across the pixels of the image. The orientation at each pixel is extracted by means of a diffusion process of the average squared gradient field. The resulting vector field, the average squared gradient vector flow, extends the orientation information from the edges of the objects to the homogeneous areas of the image. The provided orientation field is then used to perform a spatially variant filtering with a linear structuring element. Results of erosion, dilation, opening and closing spatially-variant on binary images prove the validity of this theoretical sound and novel approach